Reachability Graphs of Two-Transition Petri Nets
نویسندگان
چکیده
The reachability graph of a Petri net is a labelled transition system that can have a very complex structure. A characterisation of reachability graphs of Petri nets with only two transitions gives insight into typical structures that also might occur with arbitrarily large nets. An important means for such a characterisation is region theory, which allows to draw conclusions from cycles occurring in labelled transition systems. Attention is drawn especially to generalised cycles, i.e. cycles in the underlying undirected graph. Our characterisation also gives rise to an algorithm for the over-approximation of a given prefix-closed language by a Petri net language.
منابع مشابه
Finite Symbolic Reachability Graphs for High-Level Petri Nets
The construction of reachability graphs (rg) is one of the most useful techniques to analyse the properties of concurrent systems modelled by Petri nets. Such a graph describes all the possible behaviours of the system, and its construction is straightforward. When high-level Petri nets are under consideration, the size of the graph most often is infinite or large. The reason for this combinato...
متن کاملSynthesis of Labelled Transition Systems into Equal-Conflict Petri Nets
This paper introduces properties preset-equality for equalconflict Petri nets and enabling-equivalence for their reachability graphs. It explores the relation between these properties and shows its use for synthesis of equal-conflict Petri nets from labelled transition systems.
متن کاملMethods of Translation of Petri Nets to NuSMV Language
The paper deals with the problem of translation of reachability graphs for place-transition and coloured Petri nets into the NuSMV language. The translation algorithms presented in the paper have been implemented as a part of the PetriNet2NuSMV tool so the translation is made automatically. The PetriNet2NuSMV tool works with reachability graphs generated by the TINA and CPN Tools software. Thus...
متن کاملEfficient Reachability Graph Representation of Petri Nets With Unbounded Counters
In this paper, we define a class of Petri nets, called Petri nets with counters, that can be seen as place/transition Petri nets enriched with a vector of integer variables on which linear operations may be applied. Their semantics usually leads to huge or infinite reachability graphs. Then, a more compact representation for this semantics is defined as a symbolic state graph whose nodes possib...
متن کاملUsing Transition Invariants for Reachability Analysis of Petri Nets
Petri nets are an important formal paradigm for modeling and analysis of discrete event systems. The related areas of application of Petri nets include deadlock avoidance and prevention, supervisory control, forbidden state detection, different aspects of flexible manufacturing systems, and many others (Zhou & DiCesare, 1993; Holloway et al., 1997; Boel et al., 1995). Quite often, given a discr...
متن کامل